Scribe Notes: Game Theory in Formal Verification, Krishnendu Chatterjee Lecture 2
نویسنده
چکیده
Game Graphs The model is based on a graph G = (S,E), consisting of a set S of states and a set E of directed edges between those states, the state transitions. We assume that every state has at least one outgoing edge. Figure 1(a) contains an example of such a graph representing a closed system where all indeterminism comes from the system itself (rather than from interaction with an outside environment).
منابع مشابه
Game Theory in Formal Verification Scribe notes for Lecture 6 Algorithms for Parity Games
In this lecture we will consider two algorithms for games with parity objectives. As before, game graph G = ((S,E), (S1, S2)) is a graph (S,E) with the finite set of states S, partitioned into Player 1 states S1 and Player 2 states S2, and edges E ∈ S × S. The set of all infinite paths in the game graph is denoted by Π. Given a path π = π0π1π2 . . ., we denote by Inf(π) the set of states occurr...
متن کاملGame Theory in Formal Verification Scribe Notes for Lecture 8 Markov Decision Processes
Simple Stochastic Game nondeterminism nondeterminism probability probability nondeterminism nondeterminism probability 1 Definitions Markov Chain (MC) Definition 1. A Markov Chain ((S, E), δ) is a graph (S, E) with a function δ : S → D(S) that maps every state to a probability distribution of successor states. There is an edge between two states s, t in S iff the probability of going from s to ...
متن کاملStrategy Construction for Parity Games with Imperfect Information
We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids ...
متن کاملCMSC 858 F : Algorithmic Game Theory Fall 2010 Market Clearing with Applications
We will look at MARKET CLEARING or MARKET EQUILIBRIUM prices. We will consider two models with linear utilities : FISHER model and ARROWDEBREU model. See [1] and chapter 5 of [2] for more details. Finally we see an application of the FISHER model to wireless networks. I have also used as reference the scribe notes for this same lecture when this course was taught by Prof. Hajiaghayi at Rutgers ...
متن کاملGame Theory in Formal Verification Scribe Notes for Lecture 5
1.1. Definition. Consider a graph (S, E). Let d be a non-negative integer and let p : S → {0, 1,. .. , d} be a function which we call the priority function. The corresponding parity objective Parity(p) is defined to be the set of (infinite) paths in which the minimal priority of infinitely often visited nodes is even. In a more symbolic notation, this reads (1) Parity(p) = π ∈ Π : min s∈Inf(π) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010